Verifiable composition of deterministic grammars
نویسندگان
چکیده
منابع مشابه
Verifiable Parse Table Composition for Deterministic Parsing
One obstacle to the implementation of modular extensions to programming languages lies in the problem of parsing extended languages. Specifically, the parse tables at the heart of traditional LALR(1) parsers are so monolithic and tightly constructed that, in the general case, it is impossible to extend them without regenerating them from the source grammar. Current extensible frameworks employ ...
متن کاملDeterministic graph grammars
Context-free grammars are one of the most classical and fundamental notions in computer science textbooks, in both theoretical and applied settings. As characterizations of the well-known class of context-free languages, they are a very prominent tool in the field of language theory. Since contextfree grammars are powerful enough to express most programming languages, they also play an importan...
متن کاملVerifiable Composition of Language Extensions
Domain-specific languages offer a variety of advantages, but their implementation techniques have disadvantages that sometimes prevent their use in practice. Language extension offers a potential solution to some of these problems, but remains essentially unused in practice. It is our contention that the main obstacle to adoption is the lack of any assurance that the compiler composed of multip...
متن کاملStrict Deterministic Aspects of Minimalist Grammars
The Minimalist Grammars (MGs) proposed by Stabler(1997) have tree-shaped derivations (Harkema, 2001b; Michaelis, 2001a). As in categorial grammars, each lexical item is an association between a vocabulary element and complex of features, and so the “yields” or “fringes” of the derivation trees are sequences of these lexical items, and the string parts of these lexical items are reordered in the...
متن کاملCOMPUTER ENGINEERING : Neumeier - - Dynamic Composition Of Agent Grammars 81 DYNAMIC COMPOSITION OF AGENT GRAMMARS
In the very near future, as pervasive computing takes root, there will be an explosion of everyday objects that are uniquely identifiable and wrapped by a computational layereffectively bringing the object to life. An important component of this system is the mechanism that will allow humans to interface with the objects. Menu Based Natural Language Interfaces ( MBNU) seem like a good candidate...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2009
ISSN: 0362-1340,1558-1160
DOI: 10.1145/1543135.1542499